Collision-Free Hashing from Lattice Problems

COS 598 D - Lattices scribe : Srdjan Krstic

The first two sections are largely based on the first two lectures by Oded Regev, course ”Lattices in Computer Science, Fall 2004. The third part is somewhat based on the paper by Oded Regev and Daniele Micciancio Worst-case to Average-case Reductions based on Gaussian Measures, SIAM Journal on Computing 37(1) pp. 267-302, 2007. and to a larger extent on the paper by O. Goldreich, S. Goldwasser...

Collision - Resistant Hashing from Ideal Lattices

An Alternative Analysis of the Open Hashing Algorithm

Abstract: Hashing is one of the most important techniques for sorting and searching. Two problems that how to design a good hash function and how to deal with the collision must be resolved when hashing is applied. First, we provide an evaluation system of hashing algorithm unsing some popular hash functions and show some evaluation results. Continuously, we present an analysis of the probabili...

Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing

We present a very practical string-commitment scheme which is provably secure based solely on collision-free hashing. Our scheme enables a computationally bounded party to commit strings to an unbounded one, and is optimal (within a small constant factor) in terms of interaction, communication, and computation. Our result also proves that constant round statistical zero-knowledge arguments and ...

Provably Secure FFT Hashing

We propose a new family of collision resistant hash functions with the distinguishing feature of being provably secure. The main technique underlying our functions is a novel use of the Fast Fourier Transform to achieve ideal “diffusion” properties, together with a random linear function to achieve compression and “confusion”. Our functions admit fast implementation both in hardware and softwar...